package com.leetcode.dp;

public class MinEditDistance {

    public static void main(String[] args) {

    }

    public int minDistance(String word1, String word2) {
        int n = word1.length();
        int m = word2.length();
        int[][] dp = new int[n + 1][m + 1];
        if (n * m == 0) {
            return n + m;
        }
        for (int i = 0; i <= n; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= m; j++) {
            dp[0][j] = j;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                int left = dp[i][j-1]+1;
                int up = dp[i - 1][j] + 1;
                int left_up = dp[i-1][j-1];
                if (word1.charAt(i - 1) != word2.charAt(j - 1)) {
                    left_up += 1;
                }
                dp[i][j] = Math.min(left, Math.min(up, left_up));
            }
        }
        return dp[n][m];
    }
}
